A neural network for shortest path computation
نویسندگان
چکیده
منابع مشابه
A neural network for shortest path computation
This paper presents a new neural network to solve the shortest path problem for inter-network routing. The proposed solution extends the traditional single-layer recurrent Hopfield architecture introducing a two-layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations ...
متن کاملA Modified Pulse Coupled Neural Network for Shortest Path Computation
Shortest path computation is a classical combinatorial optimization problem. Neural networks, as a class of effective optimization approaches, have been used for processing path optimization problems for a long time. Pulse Coupled Neural Network (PCNN) is a very different neural network, which has also been proposed to compute shortest paths in recent years. In some existing PCNN models, the co...
متن کاملShortest Path Using Neural Network
Shortest path problem is solved by using the famous Dijkstra's algorithm, which would quickly provide a global optimization solution in most instances. But when the weight is not given, this method does not work. This research paper examines and analyzes the use of neural networks for finding the weights. A neural network is an artificial representation of human brain that tries to simulate the...
متن کاملA discrete-time recurrent neural network for shortest-path routing
This paper presents a discrete-time recurrent neural network, with a fixed step parameter, for solving the shortest path problem. The proposed discrete-time recurrent neural network with a simple architecture is proven to be globally convergent to exact optimal solutions and is suitable for hardware implementation. Furthermore, an improved network with a larger step size independent of the prob...
متن کاملConstrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks
سال: 2001
ISSN: 1045-9227
DOI: 10.1109/72.950136